B-trees - определение. Что такое B-trees
Diclib.com
Словарь онлайн

Что (кто) такое B-trees - определение

A SELF-BALANCING, TREE-BASED DATA STRUCTURE, THAT ALLOWS READ/WRITE ACCESS IN LOGARITHMIC TIME
B tree; B-Tree; B-trees; B*-tree; B* tree; B-star tree; Btree; Btrees; B tree indexing; Bayer tree; B Tree; B.tree; BTree
  • 1998}}.

B-tree         
<algorithm> A multi-way balanced tree. The "B" in B-tree has never been officially defined. It could stand for "balanced" or "Bayer", after one of the original designers of the algorithms and structure. A B-tree is _not_ (necessarily?) a "binary tree". A B+-tree (as used by IBM's VSAM) is a B-tree where the leaves are also linked sequentially, thus allowing both fast random access and sequential access to data. [Knuth's Art of Computer Programming]. [Example algorithm?] (2000-01-10)
B-tree         

In computer science, a <b>B-treeb> is a self-balancing tree data structure that maintains sorted data and allows searches, sequential access, insertions, and deletions in logarithmic time. The B-tree generalizes the binary search tree, allowing for nodes with more than two children. Unlike other self-balancing binary search trees, the B-tree is well suited for storage systems that read and write relatively large blocks of data, such as databases and file systems.

Trees of New York City         
  • 133x133px
  • 133x133px
  • 133x133px
  • 133x133px
  • 133x133px
TREES OF NYC
Trees in nyc; Trees in NYC; Nyc trees; Ny trees; Trees in New York City; Tree of Hope
The land comprising New York City holds approximately 5.2 million trees and 168 different tree species, as of 2020.

Википедия

B-tree

In computer science, a B-tree is a self-balancing tree data structure that maintains sorted data and allows searches, sequential access, insertions, and deletions in logarithmic time. The B-tree generalizes the binary search tree, allowing for nodes with more than two children. Unlike other self-balancing binary search trees, the B-tree is well suited for storage systems that read and write relatively large blocks of data, such as databases and file systems.